package com.mystudy.leetcode.problem.tree.p_617;

import com.mystudy.leetcode.base.TreeNode;

/**
 * @author 周志龙
 * @Email 15216876513@163.com
 * @Date on 2019/7/25 23:44
 * @Description 合并二叉树
 */
public class Solution {
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        if(t1 == null && t2 == null){
          return null;
        }
        if(t1 == null && t2 != null){
            return t2;
        }
        if(t1 != null && t2 == null){
            return t1;
        }
        t1.val = t1.val +t2.val;
        t1.left = mergeTrees(t1.left,t2.left);
        t2.right = mergeTrees(t1.right,t2.right);
        return t1;
    }






}
